The extensional realizability model of continuous functionals and three weakly non-constructive classical theorems
نویسنده
چکیده
Abstract. We investigate wether three statements in analysis, that can be proved classically, are realizable in the realizability model of extensional continuous functionals induced by Kleene’s second model K2. We prove that a formulation of the Riemann Permutation Theorem as well as the statement that all partially Cauchy sequences are Cauchy cannot be realized in this model, while the statement that the product of two anti-Specker spaces is anti-Specker can be realized.
منابع مشابه
Canonical Effective Subalgebras of Classical Algebras as Constructive Metric Completions
We prove general theorems about unique existence of effective subalgebras of classical algebras. The theorems are consequences of standard facts about completions of metric spaces within the framework of constructive mathematics, suitably interpreted in realizability models. We work with general realizability models rather than with a particular model of computation. Consequently, all the resul...
متن کاملClassical and constructive hierarchies in extended intuitionistic analysis
This paper introduces an extension A of Kleene’s axiomatization of Brouwer’s intuitionistic analysis, in which the classical arithmetical and analytical hierarchies are faithfully represented as hierarchies of the domains of continuity. A domain of continuity is a relation R(α) on Baire space with the property that every constructive partial functional defined on {α : R(α)} is continuous there....
متن کاملSome fixed point theorems for weakly subsequentially continuous and compatible of type (E) mappings with an application
In this paper, we will establish some xed point results for two pairs of self mappings satisfying generalized contractive condition by using a new concept as weak subsequential continuity with compatibility of type (E) in metric spaces, as an application the existence of unique common solution for a system of functional equations arising in system programming is proved.
متن کاملTowards a Formal Theory of Computability
We sketch a constructive formal theory TCF of computable functionals, based on the partial continuous functionals as their intendend domain. Such a task had long ago been started by Dana Scott [12, 15], under the wellknown abbreviation LCF (logic of computable functionals). The present approach differs from Scott’s in two aspects. (i) The intended semantical domains for the base types are non-f...
متن کاملCritical fixed point theorems in Banach algebras under weak topology features
In this paper, we establish some new critical fixed point theorems for the sum $AB+C$ in a Banach algebra relative to the weak topology, where $frac{I-C}{A}$ allows to be noninvertible. In addition, a special class of Banach algebras will be considered.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Logical Methods in Computer Science
دوره 11 شماره
صفحات -
تاریخ انتشار 2015